[20251207] BOJ / G5 / 컨베이어 벨트 위의 로봇 / 강신지 #1604
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/20055
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
길이가 N인 컨베이어 벨트가 있고 길이가 2N인 벨트가 이를 감싸고 있음
위 4단계를 계속 반복하며 내구도 문제로 종료되었을 때 몇 번째 단계가 진행 중이었는지 출력
🔍 풀이 방법
그냥 하란대로 구현하면 댑니다
⏳ 회고
컨베이어 벨트 돌아가고 로봇 움직이는 거 다 그냥 일일이 배열에서 위치 옮겨도 됨 n이 100이하임